#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
class Solution {
public:
	int findContentChildren(vector<int>& g, vector<int>& s) {
		std::sort(g.begin(), g.end());
		std::sort(s.begin(), s.end());
		vector<int> m;
		for (int i = 0; i < g.size(); ++i) {
			vector<int>::iterator itr = s.begin();
			for (; itr != s.end(); ++itr) {
				if (g[i] <= *itr) {
					m.push_back(*itr);
					itr = s.erase(itr);
					break;
				}
			}
		}
		return m.size();
	}
};
int main() {

	cout << "hello world" << endl;

	system("pause");
}